A gradient-type algorithm optimizing the coupling between matrices
نویسندگان
چکیده
In this paper, we consider the problem of maximizing the coupling between the isometric projections of two square matrices of dimensions m and n. This coupling is defined as an inner product between the matrices. This is a non-convex optimization problem with isometry constraints on the variables. The optimization set is an equinormed set and we develop a gradient-type algorithm to solve the problem. Numerical experiments and an application to graph matching are also presented. © 2007 Elsevier Inc. All rights reserved. AMS classification: 15A18; 15A60; 65K15; 65K10; 05C50
منابع مشابه
Optimizing the Coupling Between Two Isometric Projections of Matrices
In this paper, we analyze the coupling between the isometric projections of two square matrices. These two matrices of dimensions m×m and n×n are restricted to a lower k-dimensional subspace under isometry constraints. We maximize the coupling between these isometric projections expressed as the trace of the product of the projected matrices. First we connect this problem to notions such as the...
متن کاملCoupling Nonlinear Element Free Galerkin and Linear Galerkin Finite Volume Solver for 2D Modeling of Local Plasticity in Structural Material
This paper introduces a computational strategy to collaboratively develop the Galerkin Finite Volume Method (GFVM) as one of the most straightforward and efficient explicit numerical methods to solve structural problems encountering material nonlinearity in a small limited area, while the remainder of the domain represents a linear elastic behavior. In this regard, the Element Free Galerkin met...
متن کاملOPTIMAL OPERATORS OF GENETIC ALGORITHM IN OPTIMIZING SEGMENTAL PRECAST CONCRETE BRIDGES SUPERSTRUCTURE
Bridges constitute an expensive segment of construction projects; the optimization of their designs will affect their high cost. Segmental precast concrete bridges are one of the most commonly serviced bridges built for mid and long spans. Genetic algorithm is one of the most widely applied meta-heuristic algorithms due to its ability in optimizing cost. Next to providing cost optimization of t...
متن کاملGlobal conjugate gradient method for solving large general Sylvester matrix equation
In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$ is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...
متن کاملThermosolutal Convection of Micropolar Rotating Fluids Saturating a Porous Medium
Double-diffusive convection in a micropolar fluid layer heated and soluted from below in the presence of uniform rotation saturating a porous medium is theoretically investigated. An exact solution is obtained for a flat fluid layer contained between two free boundaries. To study the onset of convection, a linear stability analysis theory and normal mode analysis method have been used. For the ...
متن کامل